Hadamard Matrices and Strongly Regular Graphs with the $3$-e.c. Adjacency Property
نویسندگان
چکیده
منابع مشابه
Hadamard Matrices and Strongly Regular Graphs with the 3-e.c. Adjacency Property
A graph is 3-e.c. if for every 3-element subset S of the vertices, and for every subset T of S, there is a vertex not in S which is joined to every vertex in T and to no vertex in S \ T. Although almost all graphs are 3-e.c., the only known examples of strongly regular 3-e.c. graphs are Paley graphs with at least 29 vertices. We construct a new infinite family of 3-e.c. graphs, based on certain...
متن کاملGeneration of Strongly Regular Graphs from Normalized Hadamard Matrices
This paper proposes an algorithm which can be used to construct strongly regular graphs from Hadamard matrices.A graph is strongly regular if there are integers and such that every two adjacent vertices have common neighbours and every two non adjacent vertices have common neighbors. Proposed method is mainly based on basic matrix manipulations. If the order of the normalized Hadamard matr ix i...
متن کاملOn the p-Rank of the Adjacency Matrices of Strongly Regular Graphs
Let F be a strongly regular graph with adjacency matrix A. Let I be the identity matrix, and J the all-1 matrix. Let p be a prime. Our aim is to study the p-rank (that is, the rank over Fp, the finite field with p elements) of the matrices M = aA + bJ + cI for integral a, b, c. This note is based on van Eijl [8]. 1. The Smith normal form Let us write M ~ N for integral matrices M and N of order...
متن کاملGraphs with a prescribed adjacency property
A graph G is said to have property P(m,n,k) if for any set of m + n distinct vertices of G there are at least k other vertices, each of which is adjacent to the first m vertices of the set but not adjacent to any of the latter n vertices. The problem that arises is that of characterizing graphs having property P(m,n,k). In this paper, we present properties of graphs satisfying the adjacency pro...
متن کاملRegular symmetric Hadamard matrices with constant diagonal
We survey constructions of regular symmetric Hadamard matrices with constant diagonal, and point out some errors in the literature.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2000
ISSN: 1077-8926
DOI: 10.37236/1545